Symbolic computation with fermions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

Distributed Symbolic Computation with DTS

We describe the design and implementation of the Distributed Threads System (DTS), a programming environment for the paralleliza-tion of irregular and highly data-dependent algorithms. DTS extends the support for fork/join parallel programming from shared memory threads to a distributed memory environment. It is currently implemented on top of PVM, adding an asynchronous RPC abstraction and tur...

متن کامل

Symbolic computation with finite biquandles

A method of computing a basis for the second Yang-Baxter cohomology of a finite biquandle with coefficients in Q and Zp from a matrix presentation of the finite biquandle is described. We also describe a method for computing the Yang-Baxter cocycle invariants of an oriented knot or link represented as a signed Gauss code. We provide a URL for our Maple implementations of these algorithms.

متن کامل

Symbolic computation with finite quandles

Algorithms are described and Maple implementations are provided for finding all quandles of order n, as well as computing all homomorphisms between two finite quandles or from a finitely presented quandle (e.g., a knot quandle) to a finite quandle, computing the automorphism group of a finite quandle, etc. Several of these programs work for arbitrary binary operation tables and hence algebraic ...

متن کامل

Towards quantum computation with Majorana fermions

In 1937 the Italian physicist Ettore Majorana proposed the existence of a massless, chargeless, spinless particle that is its own antiparticle. Such a Majorana fermion would have an extraordinarily large phase coherence time, making it an ideal building block for a quantum computer. However, no Majorana fermions are known to exist asfundamental particles. The recent discovery of topological sta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 1990

ISSN: 0747-7171

DOI: 10.1016/s0747-7171(08)80164-2